A reduction of the logspace shortest path problem to biconnected graphs
نویسنده
چکیده
In this paper, we reduce the logspace shortest path problem to biconnected graphs; in particular, we present a logspace shortest path algorithm for general graphs which uses a logspace shortest path oracle for biconnected graphs. We also present a linear time logspace shortest path algorithm for graphs with bounded vertex degree and biconnected component size, which does not rely on an oracle. The asymptotic timespace product of this algorithm is the best possible among all shortest path algorithms.
منابع مشابه
On the logspace shortest path problem
In this paper, we reduce the logspace shortest path problem to biconnected graphs; in particular, we present a logspace shortest path algorithm for general graphs which uses a logspace shortest path oracle for biconnected graphs. We also present a linear time logspace shortest path algorithm for graphs with bounded vertex degree and biconnected component size, which does not rely on an oracle. ...
متن کاملLogspace Optimisation Problems and their Approximation Properties
This paper introduces logspace optimisation problems as analogues of the well-studied polynomial-time optimisation problems. Similarly to them, logspace optimisation problems can have vastly different approximation properties, even though the underlying existence and budget problems have the same computational complexity. Numerous natural problems are presented that exhibit such a varying compl...
متن کاملReachability in K3,3-free and K5-free Graphs is in Unambiguous Logspace
We show that the reachability problem for directed graphs that are either K3,3-free or K5-free is in unambiguous log-space, UL∩ coUL. This significantly extends the result of Bourke, Tewari, and Vinodchandran that the reachability problem for directed planar graphs is in UL∩ coUL. Our algorithm decomposes the graphs into biconnected and triconnected components. This gives a tree structure on th...
متن کاملA Logspace Approximation Scheme for the Shortest Path Problem for Graphs with Bounded Independence Number
How difficult is it to find a path between two vertices in finite directed graphs whose independence number is bounded by some constant k? The independence number of a graph is the largest number of vertices that can be picked such that there is no edge between any two of them. The complexity of this problem depends on the exact question we ask: Do we only wish to tell whether a path exists? Do...
متن کاملReachability in K 3 , 3 - free and K 5 - free Graphs is in Unambiguous
We show that the reachability problem for directed graphs that are either K3,3-free or K5-free is in unambiguous log-space, UL ∩ coUL. This significantly extends the result of Bourke, Tewari, and Vinodchandran that the reachability problem for directed planar graphs is in UL ∩ coUL. Our algorithm decomposes the graphs into biconnected and triconnected components. This gives a tree structure on ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1511.07100 شماره
صفحات -
تاریخ انتشار 2015